LAPACKrc: Fast linear algebra kernels/solvers for FPGA accelerators
نویسندگان
چکیده
منابع مشابه
High-Performance Linear Algebra Processor using FPGA
With recent advances in FPGA (Field Programmable Gate Array) technology it is now feasible to use these devices to build special purpose processors for floating point intensive applications that arise in scientific computing. FPGA provides programmable hardware that can be used to design custom hardware without the high-cost of traditional hardware design. In this talk we discuss two multi-proc...
متن کاملBases for Fast Numerical Linear Algebra
The fundamental ideas of wavelets are introduced within the context of mathematical physics. We present essential background notions of mathematical bases, and discuss Fourier, polynomial, and wavelets bases in this light. We construct several types of wavelets and wavelet-like bases and illustrate their use in algorithms for the solution of a variety of integral and di erential equations.
متن کاملFast Algorithms for Linear Algebra Modulo N
Many linear algebra problems over the ring ZZN of integers modulo N can be solved by transforming via elementary row operations an n ⇥ m input matrix A to Howell form H. The nonzero rows of H give a canonical set of generators for the submodule of (ZZN ) m generated by the rows of A. In this paper we present an algorithm to recover H together with an invertible transformation matrix P which sat...
متن کاملSequential Communication Bounds for Fast Linear Algebra
In this note we obtain communication cost lower and upper bounds on the algorithms for LU and QR given in (Demmel, Dumitriu, and Holtz 2007). The algorithms there use fast, stable matrix multiplication as a subroutine and are shown to be as stable and as computationally efficient as the matrix multiplication subroutine. We show here that they are also as communication-efficient (in the sequenti...
متن کاملFast linear algebra is stable
In [23] we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of n-by-n matrices can be done by any algorithm in O(n) operations for any η > 0, then it can be done stably in O(n) operations for any η > 0. Here we extend this result to show that essentially all standard linear algebra operations, includin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2009
ISSN: 1742-6596
DOI: 10.1088/1742-6596/180/1/012042